EXTREMAL CODES FOR SPEED-UP OF DISTRIBUTED PARALLEL ARBITRATION∗
نویسندگان
چکیده
منابع مشابه
Extremal Codes for Speed-up of Distributed Parallel Arbitration
This paper describes a method that allows the speed up of parallel processes in distributed arbitration schemes as used in Futurebus+. It is based on special arbitration codes that decrease the maximal arbitration time to a specified value. Such codes can be applied with few, if any, minor changes of the hardware. The general structure of these codes is given. Introduction. One important compon...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملCombinatorial Bounds for Authentication Codes with Arbitration
Unconditionally secure authentication codes with arbitration (A 2 -codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities for A 2 -codes in terms of the number of source states, that of the whole messages and that of messages which the receiver accepts as authen...
متن کاملGOB designs for authentication codes with arbitration
Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine a-resolvable $+$ BIBDs and $\alpha$-resolvable designs with some special properties, respectively. In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced combinatorial structu...
متن کاملAccessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads
Mirror sites enable client requests to be serviced by any of a number of servers, reducing load at individual servers and dispersing network load. Typically, a client requests service from a single mirror site. We consider enabling a client to access a file from multiple mirror sites in parallel to speed up the download. To eliminate complex client-server negotiations that a straightforward imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Algorithms and Applications
سال: 1995
ISSN: 1063-7192
DOI: 10.1080/10637199508915494